package com.zhao.leetcode.arr;

import java.util.Arrays;

public class AddNum {

    public static void main(String[] args) {

        int[] nums = {2, 7, 11, 15};
        int target = 9;

        int[] num = twoSum(nums,target);

        System.out.println(Arrays.toString(num));

    }

    public static int[] twoSum(int[] nums, int target) {

        for(int i = 0 ; i < nums.length - 1 ; i ++) {
            for(int j = i + 1 ; j < nums.length ; j ++) {
                if((nums[i] + nums[j]) == target ) {
                    return new int[]{i,j};
                }
            }
        }
        return null;

    }

}
